A Novel Framework for Efficient Bidding Based Scheduling in Virtualized Clouds

Cloud computing is a new technology for future computing platforms and it is to provide easier access to remote computational resources. An essential requirement in cloud computing environment is scheduling the current jobs to be executed with the given constraints. The scheduler should order the jobs in a way where balance between improving the quality of services and at the same time maintaining the efficiency and fairness among the jobs. Thus, evaluating the performance of scheduling algorithms is crucial towards realizing large-scale distributed systems. The goal of cloud task scheduling is to achieve high system throughput and to allocate various computing resources to applications. In this paper a novel agent based scheduling mechanism is used in real time task. On the basis of bidirectional announcement bidding mechanism, an agent based dynamic scheduling algorithm is proposed. Bidirectional announcement bidding mechanism consist of three phases that is basic matching phase, forward announcement bidding phase and backward announcement bidding phase. Based on this a tree is formed using binary search tree algorithm. The result shows an agent based scheduling algorithm can effectively solve the real time tasks scheduling problems in